Forbidden subgraphs generating a finite set
نویسندگان
چکیده
For a set F of connected graphs, a graph G is said to be F-free if G does not contain any member of F as an induced subgraph. The members of F are referred to as forbidden subgraphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow the existence of exceptional graphs as long as their number is finite. However, in this type of research, if the set of k-connected F-free graphs itself, denoted by Gk(F), is finite, then every ∗Partially supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research (C), 22500018, 2011
منابع مشابه
Forbidden Subgraphs Generating Almost the Same Sets
Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph. Let Fk(H) be the set of k-connected H-free graphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow a finite exceptional set of graphs. But if the symmetric difference of Fk(H1) and Fk(H2) is finite and we allow ...
متن کاملMatrix partitions of perfect graphs
Given a symmetric m by m matrix M over 0, 1, ∗, the M -partition problem asks whether or not an input graph G can be partitioned into m parts corresponding to the rows (and columns) of M so that two distinct vertices from parts i and j (possibly with i = j) are nonadjacent if M(i, j) = 0, and adjacent if M(i, j) = 1. These matrix partition problems generalize graph colourings and homomorphisms,...
متن کاملDeciding whether there are infinitely many prime graphs with forbidden induced subgraphs
7 A homogeneous set of a graph G is a set X of vertices such that 2 ≤ |X| < |V (G)| 8 and no vertex in V (G) − X has both a neighbor and a non-neighbor in X. A graph 9 is prime if it has no homogeneous set. We present an algorithm to decide whether a 10 class of graphs given by a finite set of forbidden induced subgraphs contains infinitely 11 many non-isomorphic prime graphs. 12
متن کاملOn circular-arc graphs having a model with no three arcs covering the circle
An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the inters...
متن کاملAutomatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs
Graph class C is induced-hereditary if for every graph G in C, every induced subgraph of G belongs to C. Induced-hereditary graph classes allow characterisation by sets of forbidden induced subgraphs. Such characterisations are very useful for automatic deduction of relations between graph classes. However, sometimes those sets of forbidden induced subgraphs are infinite, what makes it difficul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013